A posteriori quantization of progressive matching pursuit streams
نویسندگان
چکیده
منابع مشابه
Redundancy-Driven A Posteriori Matching Pursuit Quantization
This paper studies quantization error in the context of Matching Pursuit coded streams. The quantization noise is shown to depend on error on both coefficients and indexes. It is moreover influenced by the redundancy of the Matching Pursuit dictionary. A novel general formulation of the structural redundancy in overcomplete decompositions is shown to enhance the accuracy of classical redundancy...
متن کاملA Posteriori Quantized Matching Pursuit
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit properties. The coefficients energy in Matching Pursuit indeed decreases with the iteration number, and the decay rate can be upper-bounded with an exponential curve driven by the redundancy of the dictionary. The redund...
متن کاملModulus quantization for matching-pursuit video coding
Overcomplete signal decomposition using matching pursuits has been shown to be an eecient technique for coding motion residual images in a hybrid video coder. Unlike orthogonal decomposition, matching pursuit uses an in-the-loop modulus quantizer which must be speciied before coding begins. This complicates the quantizer design, since the optimal quantizer depends on the statistics of the match...
متن کاملAtom modulus quantization for matching pursuit video coding
We provide an analytical study of the selection and modulus quantization of matching pursuits (MP) coefficients. We demonstrate that an optimal rate-distortion trade-off is achieved by selecting the atoms up to a dead-zone threshold, and by defining the modulus quantizer in terms of that threshold. In doing so, we take into account quantization error re-injection resulting from inserting the mo...
متن کاملTheory of matching pursuit
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound is tighter than the KPCA bound of Shawe-Taylor et al [7] and highly predictive of the size of the subspace needed to capture most of the variance in the data. We analyse a second matching pursuit algorithm called kern...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2004
ISSN: 1053-587X
DOI: 10.1109/tsp.2003.821105